Heterogeneous Implementation of a Voronoi Cell-Based SVP Solver
نویسندگان
چکیده
منابع مشابه
A cgal-based implementation for the Voronoi diagram of ellipses
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm, for the given problem. It is based on the cgal package for the Apollonius diagram in the plane: exploiting the generic programming principle, our main additions conc...
متن کاملEvaluation of a hardware implementation of the SVP concurrency model
SVP is a general concurrency model that has been implemented in the ISA of a multi-threaded core, both of which support dataflow synchronisation with imperative programming. This core is used as a building block to design systems-on-chip comprising many cores, either for general-purpose use or for specific applications. The major advantages of this implementation include asynchrony, i.e. the ab...
متن کاملGeneralized Voronoi Partition Based Multi-Agent Search using Heterogeneous Sensors
In this paper we propose search strategies for heterogeneous multi-agent systems. Multiple agents, equipped with communication gadget, computational capability, and sensors having heterogeneous capabilities, are deployed in the search space to gather information such as presence of targets. Lack of information about the search space is modeled as an uncertainty density distribution. The uncerta...
متن کاملA PGAS-based implementation for the unstructured CFD solver TAU
Whereas most applications in the realm of the partitioned global address space make use of PGAS languages we here demonstrate an implementation on top of a PGAS-API. In order to improve the scalability of the unstructured CFD solver TAU we have implemented an asynchronous communication strategy on top of the PGAS-API of GPI. We have replaced the bulk-synchronous two-sided MPI exchange with an a...
متن کاملApproximating a Voronoi Cell
Given a set of points in IR , called sites, we consider the problem of approximating the Voronoi cell of a site by a convex polyhedron with a small number of facets or, equivalently, of finding a small set of approximate Voronoi neighbors of . More precisely, we define an -approximate Voronoi neighborhood of , denoted , to be a subset of satisfying the following property: is an -approximate nea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2939142